Pseudorandom Generators without the XOR Lemma
نویسندگان
چکیده
منابع مشابه
Pseudorandom Generators without the XOR Lemma
Impagliazzo andWigderson IW have recently shown that if there exists a decision problem solvable in time O n and having circuit complexity n for all but nitely many n then P BPP This result is a culmination of a series of works showing connections between the existence of hard predicates and the existence of good pseudorandom generators The construction of Impagliazzo andWigderson goes through ...
متن کاملExtractors and Pseudorandom generators using the hard core lemma
We present a construction of an extractor based exclusively on hardness amplification which extracts from sources with (some) polynomially small min-entropy. This improves upon a similar construction of the author with Trevisan ([DT09]) both in terms of the entropy rate and seed length. The extractor in [DT09] could extract from N -bit sources with entropy γN (for γ > 0) using a seed of length ...
متن کاملThe Generalized XOR Lemma
The XOR Lemma states that a mapping is regular or balanced if and only if all the linear combinations of the component functions of the mapping are balanced Boolean functions. The main contribution of this paper is to extend the XOR Lemma to more general cases where a mapping may not be necessarily regular. The extended XOR Lemma has applications in the design of substitution boxes or S-boxes u...
متن کاملOn Yao's XOR-Lemma
A fundamental lemma of Yao states that computational weakunpredictability of Boolean predicates is amplified when the results of several independent instances are XOR together. We survey two known proofs of Yao’s Lemma and present a third alternative proof. The third proof proceeds by first proving that a function constructed by concatenating the values of the original function on several indep...
متن کاملRobust Pseudorandom Generators
Let G : {0, 1} → {0, 1} be a pseudorandom generator. We say that a circuit implementation of G is (k, q)-robust if for every set S of at most k wires anywhere in the circuit, there is a set T of at most q|S| outputs, such that conditioned on the values of S and T the remaining outputs are pseudorandom. We initiate the study of robust PRGs, presenting explicit and non-explicit constructions in w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2001
ISSN: 0022-0000
DOI: 10.1006/jcss.2000.1730